Counting Colorful Tilings of Rectangular Arrays
نویسندگان
چکیده
In this paper we give recursive formulas for the number of colorful tilings of small rectangular arrays. We enumerate the tilings of a 2 × n board with painted squares, dominoes, and I-trominoes. We also provide a recursion formula for the number of tilings of a 3 × n board with colorful squares and dominoes. Finally, we describe a general method for calculating the number of colorful tilings of an m × n board with squares and dominoes.
منابع مشابه
Sandpiles and Dominos
We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of domino tilings of a corresponding weighted rectangular checkerboard; (ii) a product of special values of Chebyshev polynomials; and (iii) a double-product wh...
متن کاملAlternative Tilings for Improved Surface Area Estimates by Local Counting Algorithms
In this paper, we first review local counting methods for perimeter estimation of piecewise smooth binary figures on square, hexagonal, and triangular grids. We verify that better perimeter estimates, using local counting algorithms, can be obtained using hexagonal or triangular grids. We then compare surface area estimates using local counting techniques for binary three-dimensional volumes un...
متن کاملCombinatorial Chessboard Rearrangements
Many problems concerning tilings of rectangular boards are of significant combinatorial interest. In this paper we introduce a similar type of counting problem based on game piece rearrangements. Many of these rearrangements satisfy recurrence relations which can be computed using various combinatorial techniques. We also present the solution to a rearrangement counterpart to the well–known kni...
متن کاملOn the number of tilings of the rectangular board with T-tetronimoes
The classical combinatorial problem of counting domino tilings of a 2n × 2m rectangle was solved by P.W. Kasteleyn and also by H.N.V. Temperley and M.E. Fisher in 1961. We shall consider the similar problem for T-tetrominoes, that is, pieces formed by 4 unit squares in the shape of a T. We give explicit formulae for the number of tilings with T-tetrominoes for the 4n × 4m rectangle when n = 1, ...
متن کاملOn Tilings of Quadrants and Rectangles and Rectangular Pattern
The problem of tiling rectangles by polyominoes generated large interest. A related one is the problem of tiling parallelograms by twisted polyominoes. Both problems are related with tilings of (skewed) quadrants by polyominoes. Indeed, if all tilings of a (skewed) quadrant by a tile set can be reduced to a tiling by congruent rectangles (parallelograms), this provides information about tilings...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017